Matching problems
نویسندگان
چکیده
منابع مشابه
Source matching problems revisited
The source matching problem is to find the minimax codes that minimize the maximum redundancies over classes of sources where relative entropy (cross entropy, discrimination information) is adopted as a criterion to measure the redundancy. The convergence of a simple approach different from Davisson and Leon-Garcia’s algorithm for finding such minimax codes is presented and shown. This approach...
متن کاملDistributed Stable Matching Problems
We consider the Stable Marriage Problem and the Stable Roommates Problem, two well-known types of the general class of Stable Matching Problems. They are combinatorial problems which can be solved by centralized algorithms in polynomial time. This requires to make public lists of preferences which agents would like to keep private. With this aim, we define the distributed version of these probl...
متن کاملPattern - Matching Problems for
The power of weighted nite automata to describe very complex images was widely studied, see [5, 6, 7]. Finite automata can be also used as an e ective tool for compression of twodimensional images. There are some software packages using this type of compression, see [12, 6]. We consider the complexity of some pattern-matching problems for two-dimensional images which are highly compressed using...
متن کاملRotational Matching Problems
This paper addresses the issue of obtaining the optimal rotation to match two functions 23 on the sphere by minimizing the squared error norm and the Kullback–Leibler information criteria. In addition, the accuracy in terms of the band-limited approximations 25 in both cases are also discussed. Algorithms for fast and accurate rotational matching play a significant role in many fields ranging f...
متن کاملRandom multi - index matching problems
The multi-index matching problem generalizes the well known matching problem by going from pairs to d-uplets. We use the cavity method from statistical physics to analyse its properties when the costs of the d-uplets are random. At low temperatures we find for d ≥ 3 a frozen glassy phase with vanishing entropy. We also investigate some properties of small samples by enumerating the lowest cost ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1971
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90067-0